Analysing Multiprogramming Queues by Generating Functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysing multiprogramming queues by generating functions

The generating function approach for analysing queueing systems has a longstanding tradition. One of the highlights is the seminal paper by Kingman on the shortest queue problem, where the author shows that the equilibrium probabilities Pm,n of the queue lengths can be written as an infinite sum of products of powers. The same approach is used by Hofri to prove that for a multiprogramming model...

متن کامل

Performance bounds for queues via generating functions

Modern applications, e.g. vlsi manufacturing, give rise to complicated queueing models, often of the re-entrant type. Their complexity, together with implications of their performance, renewed interest in their performance and the computation of good control (e.g. scheduling) policies. Recent work concentrated on computable (mostly linear) performance bounds. We show that the linear bounds can ...

متن کامل

A compensation procedure for multiprogramming queues

In this paper we study a multiprogramming system consisting of an input-output unit (IO unit) and a central processor (CP). This system can be represented by a continuous time Markov process with states (m, n), where m and n denote the number of jobs at the CP and the IO unit respectively. The computation of the equilibrium distribution {Pro,,} of this Markov process is the purpose of the analy...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

Analysing Functions by Projection-Based Backward Abstraction

Various techniques for strictness analysis by non-standard interpretation have been proposed in which the basic non-standard values are projections. We show that continuous functions can be completely characterised by appropriate forward and backward abstractions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Applied Mathematics

سال: 1993

ISSN: 0036-1399,1095-712X

DOI: 10.1137/0153056